全文获取类型
收费全文 | 9539篇 |
免费 | 716篇 |
国内免费 | 259篇 |
专业分类
化学 | 1258篇 |
晶体学 | 28篇 |
力学 | 1060篇 |
综合类 | 145篇 |
数学 | 6658篇 |
物理学 | 1365篇 |
出版年
2024年 | 14篇 |
2023年 | 97篇 |
2022年 | 196篇 |
2021年 | 329篇 |
2020年 | 195篇 |
2019年 | 212篇 |
2018年 | 233篇 |
2017年 | 321篇 |
2016年 | 302篇 |
2015年 | 220篇 |
2014年 | 448篇 |
2013年 | 543篇 |
2012年 | 604篇 |
2011年 | 467篇 |
2010年 | 436篇 |
2009年 | 548篇 |
2008年 | 543篇 |
2007年 | 595篇 |
2006年 | 480篇 |
2005年 | 421篇 |
2004年 | 329篇 |
2003年 | 311篇 |
2002年 | 286篇 |
2001年 | 260篇 |
2000年 | 258篇 |
1999年 | 193篇 |
1998年 | 210篇 |
1997年 | 192篇 |
1996年 | 129篇 |
1995年 | 160篇 |
1994年 | 132篇 |
1993年 | 111篇 |
1992年 | 100篇 |
1991年 | 85篇 |
1990年 | 75篇 |
1989年 | 61篇 |
1988年 | 47篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 53篇 |
1984年 | 50篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
给出了大规模界约束优化的一个子空间截断牛顿法。利用截断牛顿法修正非有效约束所对应的变量,用投影梯度法修正有效约束所对应的变量,文中证明了方法的整体收敛性,并对方法进行了数值试验,且与子空间有限内存拟牛顿法进行了数值比较。 相似文献
122.
在本文中,我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件,并构造了一个有限终止外逼近算法。 相似文献
123.
箱覆盖问题是NP困难问题中的经典问题,得到了广泛地研究,九十年代以来,半定松驰策略被用来求解组合优化问题,取得了很好的结果[13],本文首次给箱覆盖问题的半定松驰算法,算法的理论分析结果表明它适合于求解大规模的箱覆盖问题。 相似文献
124.
图的划分问题曾引起图论界的广泛关注,在文献[4]中讨论了k-单圈划分,本文进一步研究基于k-单圈划分的优化问题,即在一个赋权图中求一个最小权可k-单圈划分的支撑子图,以及对一个不存在k-单圈划分支撑子图的图,如何添最少的边使得它有k-单圈划分的支撑子图。 相似文献
125.
James M. Calvin 《Journal of Global Optimization》1993,3(2):223-232
A sequential Bayesian method for finding the maximum of a function based on myopically minimizing the expected dispersion of conditional probabilities is described. It is shown by example that an algorithm that generates a dense set of observations need not converge to the correct answer for some priors on continuous functions on the unit interval. For the Brownian motion prior the myopic algorithm is consistent; for any continuous function, the conditional probabilities converge weakly to a point mass at the true maximum. 相似文献
126.
The sum of the largest eigenvalues of a symmetric matrix is a nonsmooth convex function of the matrix elements. Max characterizations for this sum are established, giving a concise characterization of the subdifferential in terms of a dual matrix. This leads to a very useful characterization of the generalized gradient of the following convex composite function: the sum of the largest eigenvalues of a smooth symmetric matrix-valued function of a set of real parameters. The dual matrix provides the information required to either verify first-order optimality conditions at a point or to generate a descent direction for the eigenvalue sum from that point, splitting a multiple eigenvalue if necessary. Connections with the classical literature on sums of eigenvalues and eigenvalue perturbation theory are discussed. Sums of the largest eigenvalues in the absolute value sense are also addressed.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.The work of this author was supported by the National Science Foundation under grants CCR-8802408 and CCR-9101640.The work of this author was supported in part during a visit to Argonne National Laboratory by the Applied Mathematical Sciences subprogram of the Office of Energy Research of the U.S. Department of Energy under contract W-31-109-Eng-38, and in part during a visit to the Courant Institute by the U.S. Department of Energy under Contract DEFG0288ER25053. 相似文献
127.
本文在集值优化的框架下提出了一个二层多目标规划模型(BLMOP).利用集值映射的相依导数和相依上导数,给出了几个有关(BLMOP)的弱有效解的必要或充分最优性条件. 相似文献
128.
This paper presents an algorithm and the supporting theory for solving a class of nonlinear multiple criteria optimization problems using Zionts—Wallenius type of interaction. The Zionts—Wallenius method, as extended in this paper, can be used for solving multiple criteria problems with concave objective and (implicit) value functions and convex feasible regions. Modifications of the method to handle nonconvex feasible regions and general nonlinear objective functions are also discussed.This research was supported, in part, by a Faculty Research Development Award and by a Council of 100 Research Grant from Arizona State University (Roy), and by a grant from Y. Jahnsson Foundation, Finland (Wallenius). The research was performed while the second author was a Visiting Professor at Arizona State University. 相似文献
129.
Pure adaptive search in global optimization 总被引:10,自引:0,他引:10
Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.This work was supported in part by NATO grant 0119/89. 相似文献
130.
本文利用不连续罚函数方法将带有不等式约束的全局优化问题的求解转化为 讨论一非线性方程的求根问题,从而得到若干个全局最优性条件. 相似文献